Generalised Composition Operations for High-level Petri Nets
نویسندگان
چکیده
We propose generic schemes for basic composition operations (sequential composition , choice, iteration, and reenement) for high-level Petri nets. They tolerate liberal combinations of place types (equal, disjoint, intersecting) and, owing to a parameterised scheme of type construction, allow for weak and strong versions of compositions. Properties such as associativity, commutativity, and coherence with respect to unfolding, are preserved.
منابع مشابه
M - nets : an Algebra of High - level Petri Nets , with an Application to the Semantics ofConcurrent Programming
This paper describes a high-level Petri net model called M-nets (for modular multilabelled nets). A distinctive feature of this model is that it allows both: unfolding, as do most other high-level net models; and composition { in particular, synchronisation { in a process algebraic style, turning the set of M-nets into an algebraic domain. It turns out that the composition operations of this do...
متن کاملA Memory Module Specification Using Composable High-Level Petri Nets
This paper describes a solution of the RPC-memory speci-cation problem deened by M. Broy and L. Lamport on the occasion of a Dagstuhl seminar in 1994. The approach is based on a recently developed model of composable high-level Petri nets called M-nets, on which CCS-like composition operations such as parallel composition, restriction and transition synchronisation are deened. Correctness proof...
متن کاملA Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
In this paper a high-level Petri net model called M-nets (for multilabeled nets) is developed. A distinctive feature of this model is that it allows not only vertical unfolding, as do most other high-level net models, but also horizontal composition in particular, synchronisation in a manner similar to process algebras such as CCS. This turns the set of M-nets into a domain whose composition op...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملA Class of Composable High Level Petri Nets
In this paper a high-level Petri net model called M-nets (for multilabeled nets) is developed. A distinctive feature of this model is that it allows not only vertical unfolding, as do most other high-level net models, but also horizontal composition-in particular, synchronisation-in a manner similar to process algebras such as CCS. This turns the set of M-nets into a domain whose composition op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 40 شماره
صفحات -
تاریخ انتشار 1999